Isomorphisms of Graph Groups

نویسنده

  • CARL DROMS
چکیده

Given a graph X, define the presentation PX to have generators the vertices of X, and a relation xy = yx for each pair x, y of adjacent vertices. Let GX be the group with presentation PX, and given a field K, let KX denote the K"-algebra with presentation PX. Given graphs X and Y and a field K, it is known that the algebras KX and KY are isomorphic if and only if the graphs X and Y are isomorphic. In this paper, we use this fact to prove that if the groups GX and GY are isomorphic, then so are the graphs X and Y. Given a graph X with vertex set V(X), we define the presentation PX to be that having as generators the elements of V(X), with a defining relation vw = wv for each pair v and w of adjacent vertices of X. PX can be regarded as a presentation of a group GX, or of a /f-algebra KX over a field K. In [1], Kim, Makar-Limanov, Neggers, and Roush proved that if the algebras KX and KY are isomorphic, then so are the graphs X and Y. (In their formulation, two generators commute provided they are not adjacent in the graph. This is sufficient for our purposes, since if two graphs are isomorphic, so are their complements.) Let K be a field. In this note we will show that if the groups GX and GY are isomorphic, then so are the algebras KX and KY, thus demonstrating: THEOREM. // the groups GX and GY are isomorphic, then so are the graphs X and Y. Let /: GX —♦ GY be an isomorphism. Denote by G2X the quotient group GX/[GX, {GX)'). Then / induces an isomorphism f2 : G2X -» G2Y. Let V{X) and V(Y) be totally ordered, and denote both orderings by <. We will not distinguish by notation between a vertex of X, the corresponding element of GX, and the image of this element in G2X. For each vertex x of X, f2{x) can be written uniquely in the form y^y^2 • • • y1¡^Cx, where Cx is an element of the commutator subgroup (G2Y)', yi < y2 < ■ ■ ■ < yn, and the integers ar are all nonzero. Define ft(x) = aiyi + a2y2 + ■ ■ ■ + anyn. We will show that the function /„ : X —> KY extends to a homomorphism /» : KX —» KY by showing that if xx' = x'x is a relation of PX, then f.{x)f.{x') = /.(a;)/*(a;') in KY. LEMMA. The commutators {[xí,Xj] | Xi < Xj and Xi and Xj are not adjacent in X} of G2X are linearly independent. PROOF. Consider the exact sequence 1 -» N -+ FX -+ GX -» 1 Received by the editors January 21, 1985 and, in revised form, May 12, 1986. 1980 Mathematics Subject Classification (1985 Revision). Primary 20F05; Secondary 20F12. ©1987 American Mathematical Society 0002-9939/87 $1.00 + $.25 per page

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups

In this paper, we investigate problems about isomorphisms and automorphism groups of Cayley digraphs. A class of Cayley digraphs, corresponding to the so-called CDI-subsets, for which the isomorphisms are uniquely determined by the group automorphisms is characterized. Their automorphism groups are also characterized.

متن کامل

Isomorphisms of Additive Cellular Automata on Finite Groups

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphism...

متن کامل

Symmetrized Induced Ramsey Theory

We prove induced Ramsey theorems in which the monochromatic induced subgraph satisfies that all members of a prescribed set of its partial isomorphisms extend to automorphisms of the colored graph (without requirement of preservation of colors). We consider vertex and edge colorings, and extensions of partial isomorphisms in the set of all partial isomorphisms between singletons as considered b...

متن کامل

Computing Isomorphisms of Association Schemes and its Application

Using computers, Hanaki and I were classifying association schemes of small order for a past few years (Hanaki and Miyamoto (1998,1998,2000),Hanaki (1999)). In the present paper we will discuss about computing isomorphisms of association schemes. We compute isomorphisms of an association scheme using its relation matrix defined in the following section. A relation matrix can be seen an adjacenc...

متن کامل

On highly closed cellular algebras

We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (i.e. the centralizer algebras of permutation groups) and of strong isomorphisms (i.e. bijections of the point sets taking one algebra to the other) respectively. If m = 1 we come to arbitrary cellular algebras and thei...

متن کامل

A ] 2 6 Ju n 20 07 CLASSIFICATION QUESTION FOR LEAVITT PATH ALGEBRAS

We prove an algebraic version of the Gauge-Invariant Uniqueness Theorem, a result which gives information about the injectivity of certain homomorphisms between Z-graded algebras. As our main application of this theorem, we obtain isomorphisms between the Leavitt path algebras of specified graphs. From these isomorphisms we are able to achieve two ends. First, we show that the K 0 groups of var...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010